package Sort.sort2020_2;

/**
 * 插入排序
 * 从小到大
 * @author: leiwenkang
 * @date: 2020/5/23
 * @time: 18:17
 */
public class InsertSort {

    public static void main(String[] args) {
        int[] array = {3,8,4,6,7,2,5,9,1};
        sort(array);
        for (int i = 0; i < array.length; i++){
            System.out.print(array[i]);
            System.out.print(" ");
        }
    }

    public static void sort(int[] array) {
        if (array == null || array.length == 0) {
            return;
        }

        for (int i = 1; i < array.length; i++) {
            if (array[i] < array[i - 1]) {
                int value = array[i];
                //比value大的值均右移
                int j;
                for (j = i - 1; j >= 0 && array[j] >= value; j--) {
                    array[j + 1] = array[j];
                }
                array[j + 1] = value;
            }
        }
    }
}
